Synthesis of self‐healing polyurethane urea‐based supramolecular materials

Supramolecular polyurethane ureas are expected to have superior mechanical properties primarily due to the reversible, noncovalent interactions such as hydrogen bonding interactions. We synthesized polyurethane prepolymers from small molecular weight of poly(tetramethylene ether)glycol and isophorone diisocyanates, which were end capped with propylamine to synthesize polyurethane ureas with high contents of urea and urethane groups for hydrogen‐bonding formations to facilitate self‐healing. The effects of polyurethane urea molecular weight (3000 ≤ M_n ≤ 9000), crosslinking, and cutting direction were studied in terms of thermal, mechanical, and morphological properties with an emphasis on the self‐healing efficiency. It was found that the thermal self‐healability was more pronounced as the molecular weight of polyurethane urea decreased, showing a maximum of more than 96% with 3000 M_n when the sample was cut along the stretch direction. © 2014 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2015 , 53, 468–474     

Modification of Polylactide Nonwovens with Carbon Nanotubes and Ladder Poly(silsesquioxane)

Electrospun nonwovens of poly(L-lactide) (PLLA) modified with multiwall carbon nanotubes (MWCNT) and linear ladder-like poly(silsesquioxane) with methoxycarbonyl side groups (LPSQ-COOMe) were obtained. MWCNT and LPSQ-COOMe were added to the polymer solution before the electrospinning. In addition, nonwovens of PLLA grafted to modified MWCNT were electrospun. All modified nonwovens exhibited higher tensile strength than the neat PLA nonwoven. The addition of 10 wt.% of LPSQ-COOMe and 0.1 wt.% of MWCNT to PLLA increased the tensile strength of the nonwovens 2.4 times, improving also the elongation at the maximum stress.     

等热流密度加热垂直下降液膜的研究

利用等热流密度加热条件下降膜流动的三维模型方程进行线性稳定性分析和数值模拟。线性稳定性分析表明，模型方程在小到中等Reynolds数下都适用，并且流向不稳定性增长率随着Reynolds数和Marangoni数增加而增加，展向不稳定性增长率则随着Marangoni数增加而增加，随着Reynolds数增加而减小，流向和展向对扰动波数都存在一个不稳定区间。三维数值模拟表明，在等热流密度加热条件下，液膜在随机扰动的情况下最终会形成带孤立波的三维溪流状结构，液膜与气体的换热也因溪流状结构的出现而加强；在随机扰动的基础上引入占优势地位的展向最不稳定扰动会使得换热增强，液膜会提前破裂；在随机扰动的基础上引入占优势地位的流向最不稳定扰动时，液膜的换热会增强，但不会提前破裂；在随机扰动的基础上同时引入占优势地位的流向和展向最不稳定扰动时，换热会加强且液膜会提前破裂。     

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A -bisection of a bridgeless cubic graph is a -colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes ( monochromatic components in what follows) have order at most . Ban and Linial Conjectured that every bridgeless cubic graph admits a -bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph with has a -edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (ie, a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we provide evidence of a strong relation of the conjectures of Ban-Linial and Wormald with Ando's Conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above-mentioned conjectures. Moreover, we prove Ban-Linial's Conjecture for cubic-cycle permutation graphs. As a by-product of studying -edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.     

Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems

Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programing problems such as solvability, duality, and complementary slackness conditions are studied in this article. As illustrations for the results, we investigate the parametric version of Gale’s example.     

Solvability of a nonlinear fifth‐order difference equation

Some formulas for well‐defined solutions to four very special cases of a nonlinear fifth‐order difference equation have been presented recently in this journal, where some of them were proved by the method of induction, some are only quoted, and no any theory behind the formulas was given. Here, we show in an elegant constructive way how the general solution to the difference equation can be obtained, from which the special cases very easily follow, which is also demonstrated here. We also give some comments on the local stability results on the special cases of the nonlinear fifth‐order difference equation previously publish in this journal.     

Classical Backfitting for Smooth-Backfitting Additive Models

Smooth backfitting has been shown to have better theoretical properties than classical backfitting for fitting additive models based on local linear regression. In this article, we show that the smooth backfitting procedure in the local linear case can be alternatively performed as a classical backfitting procedure with a different type of smoother matrices. These smoother matrices are symmetric and shrinking and some established results in the literature are readily applicable. The connections allow the smooth backfitting algorithm to be implemented in a much simplified way, give new insights on the differences between the two approaches in the literature, and provide an extension to local polynomial regression. The connections also give rise to a new estimator at data points. Asymptotic properties of general local polynomial smooth backfitting estimates are investigated, allowing for different orders of local polynomials and different bandwidths. Cases of oracle efficiency are discussed. Computer-generated simulations are conducted to demonstrate finite sample behaviors of the methodology and a real data example is given for illustration. Supplementary materials for this article are available online.     

New lower bounds on the size of (n,r)‐arcs in PG(2,q)

An $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ is a set of $n$ points such that each line contains at most $r$ of the selected points. It is well known that $\left(n,r\right)$‐arcs in $\text{PG}\left(2,q\right)$ correspond to projective linear codes. Let $m_r\left(2,q\right)$ denote the maximal number $n$ of points for which an $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ exists. In this paper we obtain improved lower bounds on $m_r\left(2,q\right)$ by explicitly constructing $\left(n,r\right)$‐arcs. Some of the constructed $\left(n,r\right)$‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.